A Dynamical Approach to Two-Block Separable Convex Optimization Problems with Linear Constraints
نویسندگان
چکیده
The aim of this manuscript is to approach by means first order differential equations/inclusions convex programming problems with two-block separable linear constraints and objectives, whereby (...
منابع مشابه
Separable convex optimization problems with linear ascending constraints
Separable convex optimization problems with linear ascending inequality and equality constraints are addressed in this paper. Under an ordering condition on the slopes of the functions at the origin, an algorithm that determines the optimum point in a finite number of steps is described. The optimum value is shown to be monotone with respect to a partial order on the constraint parameters. More...
متن کاملA Polynomial-Time Descent Method for Separable Convex Optimization Problems with Linear Constraints
We propose a polynomial algorithm for a separable convex optimization problem with linear constraints. We do not make any additional assumptions about the structure of the objective function except for polynomial computability. That is, the objective function can be non-differentiable. The running time of our algorithm is polynomial in the size of the input consisting of an instance of the prob...
متن کاملTwo-Level Optimization Problems with Infinite Number of Convex Lower Level Constraints
This paper proposes a new form of optimization problem which is a two-level programming problem with infinitely many lower level constraints. Firstly, we consider some lower level constraint qualifications (CQs) for this problem. Then, under these CQs, we derive formula for estimating the subdifferential of its valued function. Finally, we present some necessary optimality condit...
متن کاملA Graph Model Proposal for Convex Non Linear Separable Problems with Linear Constraints
Abstract—The solution of non linear problems are based on very well grounded mathematical theories. This document proposes a Newton step graph-based model for convex non linear separable problems (NLP) with linear constraints. The Newton step is well suited for this kind of problems, but when the problem size grows the NLSP model will grow in a non linear manner. Furthermore, the constraints ha...
متن کاملEfficient parallel coordinate descent algorithm for convex optimization problems with separable constraints: application to distributed MPC
In this paper we propose a parallel coordinate descent algorithm for solving smooth convex optimization problems with separable constraints that may arise e.g. in distributed model predictive control (MPC) for linear network systems. Our algorithm is based on block coordinate descent updates in parallel and has a very simple iteration. We prove (sub)linear rate of convergence for the new algori...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Numerical Functional Analysis and Optimization
سال: 2021
ISSN: ['1532-2467', '0163-0563']
DOI: https://doi.org/10.1080/01630563.2020.1845730